Commonality-Based ABox Retrieval
نویسنده
چکیده
منابع مشابه
Resolution-Based Execution of Description Logics Programs for Instance-Retrieval
This paper compares two resolution-based ABox reasoning techniques over the description logic language ALC. Queries are executed in a Prolog-framework using the PTTP (Prolog Technology Theorem Proving) approach. The aim of these reasoning algorithms is to efficiently answer instance-check and instance-retrieval queries when large amounts of data are stored in the ABox. We describe two approache...
متن کاملRewriting-Based Instance Retrieval for Negated Concepts in Description Logic Ontologies
Instance retrieval computes all instances of a given concept in a consistent description logic (DL) ontology. Although it is a popular task for ontology reasoning, there is no scalable method for instance retrieval for negated concepts by now. This paper studies a new approach to instance retrieval for negated concepts based on query rewriting. A class of DL ontologies called the inconsistency-...
متن کاملSemantic Retrieval System Based on Ontology
The recall factor is low when keywords are used to retrieve information, and many related documents are omitted. Semantic annotation is used to comment documents to improve the recall factor. While extremely large instances querying requirements may crash ABox reasoner. In this research, a method is proposed to improve the efficiency of semantic retrieving via combining ABox reasoning and datab...
متن کاملA Resolution Based Description Logic Calculus
We present a resolution based reasoning algorithm called DL calculus that decides concept satisfiability for the SHIQ language. Unlike existing resolution based approaches, the DL calculus is defined directly on DL expressions. We argue that working on this high level of abstraction provides an easier to grasp algorithm with less intermediary transformation steps and increased efficiency. We gi...
متن کاملModule Extraction for Efficient Object Queries over Ontologies with Large ABoxes.
The extraction of logically-independent fragments out of an ontology ABox can be useful for solving the tractability problem of querying ontologies with large ABoxes. In this paper, we propose a formal definition of an ABox module, such that it guarantees complete preservation of facts about a given set of individuals, and thus can be reasoned independently w.r.t. the ontology TBox. With ABox m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000